A Modified Projection and Contraction Method for a Class of Linear Complementarity Problems∗1)
نویسنده
چکیده
Recently, we have proposed an iterative projection and contraction (PC) method for a class of linear complementarity problems (LCP). The method was showed to be globally convergent, but no statement could be made about the rate of convergence. In this paper, we develop a modified globally linearly convergent PC method for linear complementarity problems. Both the method and the convergence proofs are very simple. The method can also be used to solve some linear variational inequalities. Several computational experiments are presented to indicate that the method is surprising good for solving some known difficult problems.
منابع مشابه
Improved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملAugmented Lagrangian method for solving absolute value equation and its application in two-point boundary value problems
One of the most important topic that consider in recent years by researcher is absolute value equation (AVE). The absolute value equation seems to be a useful tool in optimization since it subsumes the linear complementarity problem and thus also linear programming and convex quadratic programming. This paper introduce a new method for solving absolute value equation. To do this, we transform a...
متن کاملA Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
متن کاملA Third-degree B-spline Collocation Scheme for Solving a Class of the Nonlinear Lane–-Emden Type Equations
In this paper, we use a numerical method involving collocation method with third B-splines as basis functions for solving a class of singular initial value problems (IVPs) of Lane--Emden type equation. The original differential equation is modified at the point of singularity. The modified problem is then treated by using B-spline approximation. In the case of non-linear problems, we first line...
متن کاملCorrector-predictor arc-search interior-point algorithm for $P_*(kappa)$-LCP acting in a wide neighborhood of the central path
In this paper, we propose an arc-search corrector-predictor interior-point method for solving $P_*(kappa)$-linear complementarity problems. The proposed algorithm searches the optimizers along an ellipse that is an approximation of the central path. The algorithm generates a sequence of iterates in the wide neighborhood of central path introduced by Ai and Zhang. The algorithm does not de...
متن کامل